#include<iostream>
#include<vector>
#include<queue>
using namespace std;
int findKthLargest(vector<int>& nums, int k) {
    priority_queue<int, vector<int>, greater<int>> ret;
    for (int i = 0; i < nums.size(); i++)
    {
        if (i < k)
        {
            ret.push(nums[i]);
            continue;
        }
        if (nums[i] > ret.top())
        {
            ret.pop();
            ret.push(nums[i]);
        }
    }
    return ret.top();
}
int main()
{
	
	return 0;
}